Grammar Flow Analysis
نویسندگان
چکیده
This paper specifies the theoretical basis for the implementation of different generators of the OPTRAN system. Grammar Flow analysis uses the techniques of data flow analysis at the meta level of compiler construction. The analogue of the states in data flow analysis are the syntax trees together with some information that is associated with trees by propagation functions. One example is the association of characteristic graphs, another example is the association of sets of matching tree patterns.
منابع مشابه
Techniques for Improving Grammar Flow Analysis
Grammar Flow Analysis (GFA) is a computation framework that can be applied to a large number of problems expressed on context-free grammars. In this framework, as was done on programs with Data Flow Analysis, those problems are split into a general resolution procedure and a set of speciic propagation functions. This paper presents a number of improvement techniques that act on the resolution p...
متن کاملAn object oriented approach to parser generation in C++
In this paper we describe the design and implementation of a system for representing context-free grammars in C++. The system allows for grammar representation at the object level, providing enhanced modularity and flexibility when compared to traditional generator-based approaches. We also describe the transformation of grammar flow analysis problems into an object-oriented framework using the...
متن کاملKnowledge of Grammar, Oral Communication Strategies, and oral Fluency: A Study of Iranian EFL Learners
This study tested the impact of implicit and explicit knowledge of grammar on learners’ use of oral communication strategies (OCSs) and the interface of OCSs and oral fluency. The study was performed on 24 male and 36 female Iranian university students of English Translation studying at Payame Nour Universities of Lar, Khonj, and Evaz chosen based on availability and ease of access. The data we...
متن کاملGrammar Analysis and Parsing by Abstract Interpretation
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problem, classical grammar flow analysis algorithms...
متن کاملGrammar semantics, analysis and parsing by abstract interpretation
We study abstract interpretations of a fixpoint protoderivation semantics defining the maximal derivations of a transitional semantics of context-free grammars akin to pushdown automata. The result is a hierarchy of bottom-up or top-down semantics refining the classical equational and derivational language semantics and including Knuth grammar problems, classical grammar flow analysis algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1991